The Transformation Calculus and its Typing
نویسنده
چکیده
Many calculi supporting a notion of state have been proposed. However this notion is nearly always based on the intuition of a store, that is a binding from name to values. The exception, monads, recently focused on for I/Os, su ers from its rigidity. The transformation calculus, an extension of lambda calculus, shows another, more general way to do that. It is di erent from others in that no orthogonal reduction rule is added to -reduction, but only structural ones. We introduce here the transformation calculus, and give our approach to its typing. Fundamental properties, like con uence, have been shown, and two type systems, simple and polymorphic, are proposed.
منابع مشابه
The Transformation Calculus
The lambda-calculus, by its ability to express any computable function, is theoretically able to represent any algorithm. However, notwithstanding their equivalence in expressiveness, it is not so easy to find a natural translation for algorithms described in an imperative way. The transformation calculus, which only extends the notion of currying in lambdacalculus, appears to be able to correc...
متن کاملAn analytic study on the Euler-Lagrange equation arising in calculus of variations
The Euler-Lagrange equation plays an important role in the minimization problems of the calculus of variations. This paper employs the differential transformation method (DTM) for finding the solution of the Euler-Lagrange equation which arise from problems of calculus of variations. DTM provides an analytical solution in the form of an infinite power series with easily computable components. S...
متن کاملTimers for Distributed Systems 1
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed π-calculus. This model extends distributed π-calculus with timers, transforming the communication channels into temporary resources. Distributed π-calculus describes located interactions between processes with restricted access to resources. We introduce time constraints by consid...
متن کاملContextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
This paper presents a call-by-need polymorphically typed lambda-calculus with letrec, case, constructors and seq. The typing of the calculus is modelled in a system-F style. Contextual equivalence is used as semantics of expressions. We also define a call-by-name variant without letrec. We adapt several tools and criteria for recognizing correct program transformations to polymorphic typing, in...
متن کاملA Note on a Typing System for the Higher-order -calculus
We study a typing assignment system for the higher-order-calculus. The system proposed is a straightforward extension of the typing system for the polyadic-calculus proposed by Kohei Honda and the author 6], by introducing a new type constructor for agents (i.e., processes abstracted on some sequence of names and variables.) We also present an eecient typing reconstruction algorithm to extract ...
متن کامل